Increasing-Chord Graphs On Point Sets
نویسندگان
چکیده
We tackle the problem of constructing increasing-chord graphs spanning point sets. We prove that, for every point set P with n points, there exists an increasing-chord planar graph with O(n) Steiner points spanning P . Further, we prove that, for every convex point set P with n points, there exists an increasingchord graph with O(n log n) edges (and with no Steiner points) spanning P .
منابع مشابه
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
An st-path in a drawing of a graph is self-approaching if during a traversal of the corresponding curve from s to any point t′ on the curve the distance to t′ is non-increasing. A path has increasing chords if it is self-approaching in both directions. A drawing is self-approaching (increasing-chord) if any pair of vertices is connected by a self-approaching (increasing-chord) path. We study se...
متن کاملMatching and Recognition of Shapes using Chord-based Point Density Graphs
We present a novel approach to matching and recognition of 2D shapes, which uses a chord-based shape representation and matches shapes by finding correspondences between chords. Given a 2D shape, we choose its basis chord such that both end points of the chord have high probability of being present under occlusion. Then the shape is transformed and represented in an internal reference frame uni...
متن کاملDominating Sets in Circulant Graphs
We give an efficient construction of a reasonably small dominating set in a circulant graph on n notes and k distinct chord lengths. This result is based on bounds on some double exponential sums.
متن کاملChord Diagrams and Gauss Codes for Graphs
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general graphs have not been studied, and are potentially equally valuable in the study of spatial graphs. We will define chord diagrams for planar embeddings of pl...
متن کاملDominating Cliques in Distance-Hereditary Graphs
1 I n t r o d u c t i o n A subset D C V is a dominating set in graph G = (V, E) iff for all vertices v E V \ D there is a vertex u E D with uv E E. It is a dominating clique in G iff D is a dominating set in G and a clique (i.e. for all u, v E D uv E E). There are many papers investigating the problem of finding minimum dominating sets in graphs with (and without) additional requirements to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 19 شماره
صفحات -
تاریخ انتشار 2014